Digite uma palavra ou frase em qualquer idioma 👆
Idioma:
Tradução e análise de palavras por inteligência artificial
Nesta página você pode obter uma análise detalhada de uma palavra ou frase, produzida usando a melhor tecnologia de inteligência artificial até o momento:
- como a palavra é usada
- frequência de uso
- é usado com mais frequência na fala oral ou escrita
- opções de tradução de palavras
- exemplos de uso (várias frases com tradução)
- etimologia
O que (quem) é exponential time - definição
Exponential time hypothesis
UNPROVEN COMPUTATIONAL HARDNESS ASSUMPTION THAT 3-SAT ISN’T SOLVABLE IN SUBEXPONENTIAL TIME IN THE WORST CASE
ETH (complexity); Strong exponential time hypothesis
In computational complexity theory, the exponential time hypothesis is an unproven computational hardness assumption that was formulated by . The hypothesis states that 3-SAT cannot be solved in subexponential time in the worst case.
exponential function
MATHEMATICAL FUNCTION WITH A CONSTANT BASE AND A VARIABLE EXPONENT, DENOTED EXP_A(X) OR A^X
Complex exponential function; Complex exponential; Natural exponential function; E^x; Exp(x); Exp (programming); Complex exponentials; Real exponential function; E**x; E to the x; Cb^x; Exponential Function; Exponential equation; Exponential equations; ⅇ; Natural exponent; Exponential minus 1 function; Exponential minus 1; Expm1; Exp-1; Exp1m; Expm1(x); Exp1m(x); Natural exponential minus 1; Natural exponential; E^X-1; E^x-1; Exp(x)-1; Base e antilogarithm; Exponent of e; Base e anti-logarithm; Exponential minus one function; Exponential minus one; Natural exponential minus one; Natural exponential minus one function; Exponential near 0; Exponential near zero; Natural exponential near 0; Natural exponential near zero; Eˣ-1; Eˣ - 1; Eˣ; Eˣ−1; Eˣ − 1; E^x−1; Exp(x)−1; Exponential base
¦ noun Mathematics a function whose value is a constant raised to the power of the argument, especially the function where the constant is e.
Time complexity
ESTIMATE OF TIME TAKEN FOR RUNNING AN ALGORITHM
Polynomial time; Exponential time; Linearithmic function; Subquadratic time; Running time; Linear time; Cubic time; Quadratic time; Algorithmic time complexity; Polynomial-time; Polynomial-time algorithm; Polynomial-time solutions; Polynomial-time solution; Computation time; Constant time; Exponential algorithm; Logarithmic time; Linear-time; Linearithmic; N log n; Weakly polynomial; Strongly polynomial; Run-time complexity; Sublinear time; Sublinear-time; Sublinear time algorithm; Linearithm; Computational time; Sub-exponential time; Super-polynomial time; Superpolynomial; Fast algorithms; Quasi-polynomial time; SUBEXP; Linearithmic time; Double exponential time; Polylogarithmic time; Sub-linear time; Polynomial time algorithm; Subexponential time; Nlogn; Quasilinear time; Strongly polynomial time; Polynomial complexity; Linear-time algorithm; Linear time agorithm; Sublinear algorithm; Polytime; Weakly polynomial time algorithm; Time complexities
In computer science, the time complexity is the computational complexity that describes the amount of computer time it takes to run an algorithm. Time complexity is commonly estimated by counting the number of elementary operations performed by the algorithm, supposing that each elementary operation takes a fixed amount of time to perform.
